A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars
نویسندگان
چکیده
Multi-type branching processes (MBPs) are stochastic processes modeling populations in which the individuals of a generation produce a random number of children of different types or species in the next generation. Individuals can be elementary particles, genes, animals, or program threads [1,2]. MBPs are classified into subcritical, critical, and supercritical, depending on the spectral radius of a certain matrix, the expectation matrix. This division plays a central role, since many theorems assume that the process belongs to one of these classes. In particular, criticality is strongly related to the extinction probability: under some weak conditions, the population of subcritical and critical processes
منابع مشابه
Explorer A polynomial time algorithm for computing extinction probabilities of multi - type branching processes
We show that one can approximate the least fixed point solution for a multivariate system of monotone probabilistic polynomial equations in time polynomial in both the encoding size of the system of equations and in log(1/ ), where > 0 is the desired additive error bound of the solution. (The model of computation is the standard Turing machine model.) We use this result to resolve several open ...
متن کاملA Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes
We show that one can approximate the least fixed point solution for a multivariate system of monotone probabilistic polynomial equations in time polynomial in both the encoding size of the system of equations and in log(1/ ), where > 0 is the desired additive error bound of the solution. (The model of computation is the standard Turing machine model.) We use this result to resolve several open ...
متن کاملWeakly Restricted Stochastic Grammars
A new type of stochastic grammars is introduced for investigation: weakly restricted stochastic grammars. In this paper we will concentrate on the consistency problem. To nd conditions for stochastic grammars to be consistent, the theory of multitype Galton-Watson branching processes and generating functions is of central importance. The unrestricted stochastic grammar formalism generates the s...
متن کاملComputing the Least Fixed Point of Positive Polynomial Systems
We consider equation systems of the form X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where f1, . . . , fn are polynomials with positive real coefficients. In vector form we denote such an equation system by X = f(X) and call f a system of positive polynomials, short SPP. Equation systems of this kind appear naturally in the analysis of stochastic models like stochastic context-free...
متن کاملA note on stochastic context-free grammars, termination and the EM-algorithm
Termination of a stochastic context-free grammar, i.e. almost sure finiteness of the random trees it produces, is shown to be equivalent to extinction of an embedded multitype branching process. We show that the maximum likelihood estimator in a saturated model based on complete or partial observation of a finite tree always gives terminating grammars. With partial observation we show that this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 113 شماره
صفحات -
تاریخ انتشار 2013